Sequential Decision Problems for Processes with Continuous Time Parameter Problems of Estimation
نویسندگان
چکیده
منابع مشابه
Sequential parameter estimation for fluid-structure problems: application to hemodynamics.
We present a robust and computationally efficient parameter estimation strategy for fluid-structure interaction problems. The method is based on a filtering algorithm restricted to the parameter space, known as the reduced-order unscented Kalman filter. It does not require any adjoint or tangent problems. In addition, it can easily be run in parallel, which is of great interest in fluid-structu...
متن کاملSequential Decision Problems
To this point in the class, we have studies stateless games when the payoff matrix is known. We have explored these games as both stage (single shot) games and as repeated games. In this portion of the class, we will continue to study repeated games, but we will assume as little about the problems as possible and we will look at a class of algorithms that allow us to represent states. To be pre...
متن کاملSequential Parameter Estimation of Time-Varying Non-Gaussian Autoregressive Processes
Parameter estimation of time-varying non-Gaussian autoregressive processes can be a highly nonlinear problem. The problem gets even more difficult if the functional form of the time variation of the process parameters is unknown. In this paper, we address parameter estimation of such processes by particle filtering, where posterior densities are approximated by sets of samples (particles) and p...
متن کاملDecomposing Parameter Estimation Problems
We propose a technique for decomposing the parameter learning problem in Bayesian networks into independent learning problems. Our technique applies to incomplete datasets and exploits variables that are either hidden or observed in the given dataset. We show empirically that the proposed technique can lead to orders-of-magnitude savings in learning time. We explain, analytically and empiricall...
متن کاملFully Polynomial Time Approximation Schemes for Sequential Decision Problems
This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and unifying, and many previous results in the literature follow as direct corollaries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1953
ISSN: 0003-4851
DOI: 10.1214/aoms/1177728980